MAXENT-F90: Fortran 90 Library for Maximum-Entropy Basis Functions
نویسنده
چکیده
This manual describes the Fortran 90 implementation of maximum-entropy basis functions. The main ingredients of the theory are presented, and then the numerical implementation is touched upon. Instructions on the installation and execution of the code, as well as on writing an interface to the library are presented. Each program module and the most important functions in each module are discussed. The F90 library can be used for different applications of maximum-entropy basis functions such as meshfree Galerkin methods and data approximation in lowerand higherdimensional parameter spaces (IR, d ≥ 1). 1 Information-Theoretic Entropy Approximants Shannon [1] introduced the concept of entropy in information theory, with an eye on its applications in communication theory. The general form of informational entropy (Shannon-Jaynes or relative entropy functional) is [2–4]:
منابع مشابه
Maximum Entropy Production as an Inference Algorithm that Translates Physical Assumptions into Macroscopic Predictions: Don't Shoot the Messenger
Is Maximum Entropy Production (MEP) a physical principle? In this paper I tentatively suggest it is not, on the basis that MEP is equivalent to Jaynes’ Maximum Entropy (MaxEnt) inference algorithm that passively translates physical assumptions into macroscopic predictions, as applied to non-equilibrium systems. MaxEnt itself has no physical content; disagreement between MaxEnt predictions and e...
متن کاملRobust Discriminant Analysis Based on Nonparametric Maximum Entropy
In this paper, we propose a Robust Discriminant Analysis based on maximum entropy (MaxEnt) criterion (MaxEnt-RDA), which is derived from a nonparametric estimate of Renyi’s quadratic entropy. MaxEnt-RDA uses entropy as both objective and constraints; thus the structural information of classes is preserved while information loss is minimized. It is a natural extension of LDA from Gaussian assump...
متن کاملA Novel Methodology for Processing Probabilistic Knowledge Bases Under Maximum Entropy
Probabilistic reasoning under the so-called principle of maximum entropy is a viable and convenient alternative to Bayesian networks, relieving the user from providing complete (local) probabilistic information and observing rigorous conditional independence assumptions. In this paper, we present a novel approach to performing computational MaxEnt reasoning that makes use of symbolic computatio...
متن کاملProbabilistic Knowledge Representation Using Gröbner Basis Theory
An often used methodology for reasoning with probabilistic conditional knowledge bases is provided by the principle of maximum entropy (so-called MaxEnt principle) that realises an idea of informational economy. In this paper we exploit the fact that MaxEnt distributions can be computed by solving nonlinear equation systems that reflect the conditional logical structure of these distributions. ...
متن کاملOrigins of the Combinatorial Basis of Entropy
The combinatorial basis of entropy, given by Boltzmann, can be written H = N−1 lnW, where H is the dimensionless entropy, N is the number of entities and W is number of ways in which a given realization of a system can occur (its statistical weight). This can be broadened to give generalized combinatorial (or probabilistic) definitions of entropy and cross-entropy: H = κ(φ(W) +C) and D = −κ(φ(P...
متن کامل